Efficient optimistic concurrency control using loosely synchronized clocks

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Unilateral version vector pruning using loosely synchronized clocks

This paper presents a new lightweight algorithm for pruning inactive entries in version vectors (VVs). This algorithm lets each node remove inactive VV entries without any coordination with other nodes. It achieves this feature by devising a new way to compare two version vectors based on loosely synchronized clocks and placing a timing restriction on the behavior of the application. VVs comput...

متن کامل

Structural Clocks for a Loosely Synchronized Data-Parallel Language

Nowadays, most of distributed architectures are MIMD (Multiple Instruction streams, Multiple Data streams) parallel computers or networks of workstations. They are easily scalable, concerning the number of processing elements, the amount of memory or the bandwidth of the underlying communication network. The challenge consists in taking advantage of the power of these architectures. It has been...

متن کامل

Optimistic and Efficient Concurrency Control for Asynchronous Collaborative Systems

Concurrency control is a key issue in distributed systems. A number of techniques have been devised to tackle the issue, but these techniques are generally unsuitable to be used in collaborative systems, which have the special requirements of consistency maintenance, responsiveness, and unconstrained interaction. OT (Operational Transformation) is an optimistic concurrency control technique ori...

متن کامل

Clock-RSM: Low-Latency Inter-Datacenter State Machine Replication Using Loosely Synchronized Physical Clocks (Technical Report)

This paper proposes Clock-RSM, a new state machine replication protocol that uses loosely synchronized physical clocks to totally order commands for geo-replicated services. Clock-RSM assumes realistic non-uniform latencies among replicas located at different data centers. It provides low-latency linearizable replication by overlapping 1) logging a command at a majority of replicas, 2) determin...

متن کامل

Optimistic Secure Real-Time Concurrency Control Using Multiple Data Version

In many real time applications, security is an important requirement, since the system maintains sensitive information to be shared by multiple users with different security levels. A secure real-time database system must satisfy not only logical data consistency but also the timing constraints and security requirements associated with transactions. Even though an optimistic concurrency control...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: ACM SIGMOD Record

سال: 1995

ISSN: 0163-5808

DOI: 10.1145/568271.223787